Note: Pancyclicity of the Prism
نویسندگان
چکیده
We show that for every 3-connected cubic graph G, the prism G×K2 has cycles of every even length. Furthermore, if G has a triangle, then G × K2 is pancyclic.
منابع مشابه
Node-pancyclicity and edge-pancyclicity of hypercube variants
Twisted cubes, crossed cubes, Möbius cubes, and locally twisted cubes are some of the widely studied hypercube variants. The 4-pancyclicity of twisted cubes, crossed cubes, Möbius cubes, locally twisted cubes and the 4-edgepancyclicity of crossed cubes are proven in [2, 1, 5, 10, 6] respectively. It should be noted that 4-edge-pancyclicity implies 4-node-pancyclicity which further implies 4-pan...
متن کاملA note on pancyclism of highly connected graphs
Jackson and Ordaz conjectured that if the stability number (G) of a graph G is no greater than its connectivity (G) then G is pancyclic. Applying Ramsey’s theorem we prove the pancyclicity of every graph G with (G) su7ciently large with respect to (G). c © 2003 Elsevier B.V. All rights reserved. MSC: 05C38; 05C45
متن کاملThe Modeling and Synthesis of Musical Signals with PRISM
Multidimensional signal modeling of musical notes can produce expressive and realistic synthesis for musical applications. The PRISM synthesis technology employs time-varying signal models using envelopes for pitch, power, and timbre evolution. PRISM also models the statistical variations of parameters over time in order to produce indefinitely long, non-looped sustains while maintaining the ch...
متن کاملPancyclicity of OTIS (swapped) networks based on properties of the factor graph
a r t i c l e i n f o a b s t r a c t The plausibility of embedding cycles of different lengths in the graphs of a network (known as the pancyclicity property) has important applications in interconnection networks, parallel processing systems, and the implementation of a number of either computational or graph problems such as those used for finding storage schemes of logical data structures, ...
متن کاملA New Chvátal Type Condition for Pancyclicity
Schmeichel and Hakimi ?], and Bauer and Schmeichel ?] gave an evidence in support of the well-known Bondy's "metaconjecture" that almost any non-trivial condition on graphs which implies that the graph is hamiltonian also implies that it is pancyclic. In particular, they proved that the metaconjecture is valid for Chvv atal's condition ?]. We slightly generalize their results giving a new Chvv ...
متن کامل